An Heuristics for Load Balancing and Granularity Control in the Parallel Instantiation of Disjunctive Logic Programs

نویسندگان

  • Simona Perri
  • Francesco Ricca
  • Marco Sirianni
چکیده

In this paper we present a dynamic heuristics that allows for improving the performance of a parallel instantiator algorithm based on the DLV system. In this system, each rule is rewritten in several “splits” of the same size that are assigned to a number of parallel instatiator subprocesses. The new heuristics allows for dynamically determining an optimal amount of work that has to be assigned to each parallel instantiator, and, thus, it improves the overall efficiency of the parallel evaluation. We implemented our heuristics and performed an experimental analysis that confirms the efficacy of the proposed method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Instantiation in DLV

Answer Set Programming (ASP) is a purely-declarative logic programming language allowing for disjunction and nonmonotonic negation. The evaluation of ASP Programs is traditionally carried out in two steps. In the first step an input program P undergoes the so-called instantiation (or grounding) process, which produces a program P ′ semantically equivalent to P , but not containing any variable;...

متن کامل

Parallel instantiation of ASP programs: techniques and experiments

Answer Set Programming (ASP) is a powerful logic-based programming language, which is enjoying increasing interest within the scientific community and (very recently) in industry. The evaluation of ASP programs is traditionally carried out in two steps. At the first step an input program P undergoes the so-called instantiation (or grounding) process, which produces a program P ′ semantically eq...

متن کامل

Advanced Heuristics for Parallel ASP Instantiation

The evaluation of ASP programs is traditionally carried out in two steps. The first is called instantiation or grounding, and consists on the computation of a ground program equivalent to the input one that, in turn, is evaluated by using a backtracking search algorithm in the second phase. Instantiation is important for the efficiency of the whole evaluation, might becomes a bottleneck in comm...

متن کامل

Pact – A Fault Tolerant Parallel Programming Environment

Pact is a parallel programming environment relieving the programmer from the burdens of parallel programming which are not really necessary to write efficient parallel programs. This is done by providing a simple synchronization model and virtual shared data with user-defined granularity and automatic consistency control. Pact guarantees user-transparent fault-tolerance with low overhead by usi...

متن کامل

Experiences from integrating algorithmic and systemic load balancing strategies

Load balancing increases the eÆcient use of existing resources for parallel and distributed applications. At a coarse level of granularity, advances in runtime systems for parallel programs have been proposed in order to control available resources as eÆciently as possible by utilizing idle resources and using task migration. Simultaneously, at a ner granularity level, advances in algorithmic s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009